Formal Veriication by Symbolic Evaluation of Partially-ordered Trajectories
نویسنده
چکیده
Symbolic trajectory evaluation provides a means to formally verify properties of a sequential system by a modiied form of symbolic simulation. The desired system properties are expressed in a notation combining Boolean expressions and the temporal logic \next-time" operator. In its simplest form, each property is expressed as an assertion A =) C], where the antecedent A expresses some assumed conditions on the system state over a bounded time period, and the consequent C expresses conditions that should result. A generalization allows simple invariants to be established and proven automatically. The veriier operates on system models in which the state space is ordered by \information content". By suitable restrictions to the speciication notation, we guarantee that for every trajectory formula, there is a unique weakest state trajectory that satisses it. Therefore, we can verify an assertion A =) C] by simulating the system over the weakest trajectory for A and testing adherence to C. Also, establishing invariants correspond to simple xed point calculations. This paper presents the general theory underlying symbolic trajectory evaluation. It also illustrates the application of the theory to the task of verifying switch-level circuits as well as more abstract implementations.
منابع مشابه
A Mathematically Precise Two-level Formal Hardware Veriication Methodology
Theorem-proving and symbolic trajectory evaluation are both described as methods for the formal veriication of hardware. They are both used to achieve a common goal|correctly designed hardware|and both are intended to be an alternative to conventional methods based on non-exhaustive simulation. However, they have diierent strengths and weaknesses. The main signiicance of this paper is the descr...
متن کاملDigital Circuit Verification Using Partially-Ordered State Models
Many aspects of digital circuit operation can be efficiently verified by simulating circuit operation over “weakened” state values. This technique has long been practiced with logic simulators, using the value X to indicate a signal that could be either 0 or 1. This concept can be formally extended to a wider class of circuit models and signal values, yielding lattice-structured state domains. ...
متن کاملUsing a Visual Formalism for Design Verification in Industrial Environments
This paper reports experiences and results gained during the evaluation of the visual formalism STD as speciication method for formal veriication, performed in cooperation with industrial partners. The visual formalism STD (Symbolic Timing Diagrams) was developed continuously since 1993 by OFFIS as a speciication method, which satisses several needs: (1) It is based on the principles used in th...
متن کاملModel Checking Partially Ordered State Spaces
The state explosion problem is the fundamental limitation of veriication through model checking. In many cases, representing the state space of a system as a lattice is an eeective way of ameliorating this problem. The partial order of the state space lattice represents an information ordering. The paper shows why using a lattice structure is desirable, and why a quaternary temporal logic rathe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993